Proofs in Satisfiability Modulo Theories
نویسندگان
چکیده
Satisfiability Modulo Theories (SMT) solvers check the satisfiability of firstorder formulas written in a language containing interpreted predicates and functions. These interpreted symbols are defined either by first-order axioms (e.g. the axioms of equality, or array axioms for operators read and write,. . . ) or by a structure (e.g. the integer numbers equipped with constants, addition, equality, and inequalities). Theories frequently implemented within SMT solvers include the empty theory (a.k.a. the theory of uninterpreted symbols with equality), linear arithmetic on integers and/or reals, bit-vectors, and the theory of arrays. A very small example of an input formula for an SMT solver is
منابع مشابه
Proof Checking Technology for Satisfiability Modulo Theories
A common proof format for solvers for Satisfiability Modulo Theories (SMT) is proposed, based on the Edinburgh Logical Framework (LF). Two problems arise: checking very large proofs, and keeping proofs compact in the presence of complex side conditions on rules. Incremental checking combines parsing and proof checking in a single step, to avoid building in-memory representations of proof subter...
متن کاملReconstruction of Z3's Bit-Vector Proofs in HOL4 and Isabelle/HOL
The Satisfiability Modulo Theories (SMT) solver Z3 can generate proofs of unsatisfiability. We present independent reconstruction of unsatisfiability proofs for bit-vector theories in the theorem provers HOL4 and Isabelle/HOL. Our work shows that LCF-style proof reconstruction for the theory of fixed-size bit-vectors, although difficult because Z3’s proofs provide limited detail, is often possi...
متن کاملFast LCF-Style Proof Reconstruction for Z3
The Satisfiability Modulo Theories (SMT) solver Z3 can generate proofs of unsatisfiability. We present independent reconstruction of these proofs in the theorem provers Isabelle/HOL and HOL4 with particular focus on efficiency. Our highly optimized implementations outperform previous LCF-style proof checkers for SMT, often by orders of magnitude. Detailed performance data shows that LCF-style p...
متن کاملProof Translation and SMT - LIB Benchmark Certification : A Preliminary Report ∗
Satisfiability Modulo Theories (SMT) solvers are large and complicated pieces of code. As a result, ensuring their correctness is challenging. In this paper, we discuss a technique for ensuring soundness by producing and checking proofs. We give details of our implementation using CVC3 and HOL Light and provide initial results from our effort to certify the SMT-LIB benchmarks.
متن کاملAutomating Induction with an SMT Solver
Mechanical proof assistants have always had support for inductive proofs. Sometimes an alternative to proof assistants, satisfiability modulo theories (SMT) solvers bring the hope of a higher degree of automation. However, SMT solvers do not natively support induction, so inductive proofs require some encoding into the SMT solver’s input. This paper shows a surprisingly simple tactic—a rewritin...
متن کامل